package com.atguigu.algorithm;

import java.util.Scanner;
public class RationalArithmical {
    //仅仅只在a>b的时候，我们进行  类似 1 a/b的处理
    public static String Rationalize(long a,long b){
        long tmp=a/b; //整数部分
        long left=a%b;
        String res=tmp+" "+left+"/"+b;
        return  res;
    }
    public static long findGcd(long a,long b) {
        if (a % b == 0) {
            return b;
        } else {
            return findGcd(b, a % b);
        }
    }
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        while(scanner.hasNextLong()){
            long a1=scanner.nextLong();
            long b1=scanner.nextLong();
            long a2=scanner.nextLong();
            long b2=scanner.nextLong();

        }
    }
}
